Information Retrieval Technology %2D 6th Asia Information Retrieval Societies Conference

Bidirectional Integration of Pipeline Models.

Adapting relational logic models using unlabeled data.

Learning ontology resolution for document representation and its applications in text mining.

Adapting relational logic models using unlabeled data.



An integrated discriminative probabilistic approach to information extraction.

Extracting discriminative concepts for domain adaptation in text mining.

An Efficient Method for Generating
Abstract. One of the five AES finalists, MARS, makes use of a 9x32 s-box with very specific combinatorial, differential and linear correlation properties. The s-box used in the cipher was selected as the best from a large sample of pseudo randomly generated tables, in a process that took IBM about a week to compute. This paper provides a faster and more effective alternative generation method using heuristic techniques to produce 9x32 s-boxes with cryptographic properties that are clearly superior to those of the MARS s-box, and typically take less than two hours to produce on a single PC. 1
Cross Language Information Extraction Knowledge Adaptation.

Mining employment market via text block detection and adaptive cross%2Ddomain information extraction.

A Semi%2DSupervised Framework for Feature Mapping and Multiclass Classification.

Mining employment market via text block detection and adaptive cross%2Ddomain information extraction.

An unsupervised method for joint information extraction and feature mining across different Web sites.

An active learning framework for semi%2Dsupervised document clustering with language modeling.

An Unsupervised Approach for Product Record Normalization across Different Web Sites.
An unsupervised probabilistic learning framework for normalizing product records across different retailer Web sites is presented. Our framework decomposes the problem into two tasks to achieve the goal. The first task aims at extracting attribute values of products from different sites and normalizing them into appropriate reference attributes. This task is challenging because the set of reference attributes is unknown in advance. Besides, the layout formats are different in different Web sites. The second task is to conduct product record normalization aiming at identifying product records referring to the same reference product based on the results of the first task. We develop a graphical model for the generation of text fragments in Web pages to accomplish the two tasks. One characteristic of our model is that the product attributes to be extracted are not required to be specified in advance and an unlimited number of previously unseen product attributes can be handled. We compare our framework with existing methods. Extensive experiments using over 300 Web pages from over 150 real-world Web sites from three different domains have been conducted demonstrating the effectiveness of our framework.
Hidden Dynamic Probabilistic Models for Labeling Sequence Data.

Pronoun Resolution with Markov Logic Networks.

Coreference resolution using expressive logic models.

An Integrated Probabilistic and Logic Approach to Encyclopedia Relation Extraction with Multiple Features.

An unsupervised framework for extracting and normalizing product attributes from multiple web sites.
We have developed an unsupervised framework for simultaneously extracting and normalizing attributes of products from multiple Web pages originated from different sites. Our framework is designed based on a probabilistic graphical model that can model the page-independent content information and the page-dependent layout information of the text fragments in Web pages. One characteristic of our framework is that previously unseen attributes can be discovered from the clue contained in the layout format of the text fragments. Our framework tackles both extraction and normalization tasks by jointly considering the relationship between the content and layout information. Dirichlet process prior is employed leading to another advantage that the number of discovered product attributes is unlimited. An unsupervised inference algorithm based on variational method is presented. The semantics of the normalized attributes can be visualized by examining the term weights in the model. Our framework can be applied to a wide range of Web mining applications such as product matching and retrieval. We have conducted extensive experiments from four different domains consisting of over 300 Web pages from over 150 different Web sites, demonstrating the robustness and effectiveness of our framework.
Learning to extract and summarize hot item features from multiple auction web sites.

Efficient Methods for Biomedical Named Entity Recognition.

Semi%2Dsupervised Document Clustering via Active Learning with Pairwise Constraints.

A Cascaded Approach to Biomedical Named Entity Recognition Using a Unified Model.

Active Learning of Constraints for Semi%2Dsupervised Text Clustering.

Named entity translation matching and learning With application for mining unseen translations.

Adapting Web information extraction knowledge via mining site%2Dinvariant and site%2Ddependent features.
We develop a novel framework that aims at automatically adapting previously learned information extraction knowledge from a source Web site to a new unseen target site in the same domain. Two kinds of features related to the text fragments from the Web documents are investigated. The first type of feature is called, a site-invariant feature. These features likely remain unchanged in Web pages from different sites in the same domain. The second type of feature is called a sitedependent feature. These features are different in the Web pages collected from different Web sites, while they are similar in the Web pages originating from the same site. In our framework, we derive the site-invariant features from previously learned extraction knowledge and the items previously collected or extracted from the source Web site. The derived site-invariant features will be exploited to automatically seek a new set of training examples in the new unseen target site. Both the site-dependent features and the site-invariant features of these automatically discovered training examples will be considered in the learning of new information extraction knowledge for the target site. We conducted extensive experiments on a set of real-world Web sites collected from three different domains to demonstrate the performance of our framework. For example, by just providing training examples from one online book catalog Web site, our approach can automatically
Utilizing hierarchical feature domain values for prediction.

Customized classification learning based on query projections.


Efficient in%2Dmemory extensible inverted file.


Text Clustering with Limited User Feedback Under Local Metric Learning.

Extracting and Summarizing Hot Item Features Across Different Auction Web Sites.

Collaborative Information Extraction and Mining from Multiple Web Documents.

Refining hierarchical taxonomy structure via semi%2Dsupervised learning.

Using Semantic Relations with World Knowledge for Question Answering.
Two research directions are to be explored in realizing our group’s TREC QA system in 2006. The first one is to investigate the possibilities of applying linguistically sophisticated grammatical framework in tackling the realworld natural language processing task such as question answering. The other is to exploit the possible world’s entities and relations as described in online encyclopedia in adding redundancy and hidden relations as those contained in the TREC corpus where the entities and relations are only implicitly mentioned and related. Our focus is on the factoid and list question as these two types of questions benefit
Integrating XML and CORBA to support collaborative writing using off%2Dthe%2Dshelf editing software.

Introduction to the special topic section on multilingual information systems.

Introduction to the special topic section on multilingual information systems.

Gene Ontology Classification of Biomedical Literatures Using Context Association.

A New Approach for Semi%2Dsupervised Online News Classification.

Discovering Patterns from Ontology%2DDerived Texts.

Hot Item Mining and Summarization from Multiple Auction Web Sites.

Training Conditional Random Fields with Unlabeled Data and Limited Number of Labeled Examples.

Exploring Query Matrix for Support Pattern Based Classification Learning.

Training Conditional Random Fields with Unlabeled Data and Limited Number of Labeled Examples.

Lazy Learning for Classification Based on Query Projections.

Learning to Refine Ontology for a New Web Site Using a Bayesian Approach.

Pattern Based Customized Learning for TREC Genomics Track Categorization Task.

Extracting causation knowledge from natural language texts.

Context%2Dbased generic cross%2Dlingual retrieval of documents and automated summaries.

Improving Transliteration with Precise Alignment of Phoneme Chunks and Using Contextual Features.

Interpretable Query Projection Learning.

CatRelate A New Hierarchical Document Category Integration Algorithm by Learning Category Relationships.

A Probabilistic Approach for Adapting Information Extraction Wrappers and Discovering New Attributes.
We develop a probabilistic framework for adapting information extraction wrappers with new attribute discovery. Wrapper adaptation aims at automatically adapting a previously learned wrapper from the source Web site to a new unseen site for information extraction. One unique characteristic of our framework is that it can discover new or previously unseen attributes as well as headers from the new site. It is based on a generative model for the generation of text fragments related to attribute items and formatting data in a Web page. To solve the wrapper adaptation problem, we consider two kinds of information from the source Web site. The first kind of information is the extraction knowledge contained in the previously learned wrapper from the source Web site. The second kind of information is the previously extracted or collected items. We employ a Bayesian learning approach to automatically select a set of training examples for adapting a wrapper for the new unseen site. To solve the new attribute discovery problem, we develop a model which analyzes the surrounding text fragments of the attributes in the new unseen site. A Bayesian learning method is developed to discover the new attributes and their headers. EM technique is employed in both Bayesian learning models. We conducted extensive experiments from a number of real-world Web sites to demonstrate the effectiveness of our framework. 1.
Query%2DDriven Support Pattern Discovery for Classification Learning.

Phoneme%2DBased Transliteration of Foreign Names for OOV Problem.
One problem seriously affecting CLIR performance is the processing of queries with embedded foreign names. A proper noun dictionary is never complete rendering name translation from English to Chinese ineffective. One way to solve this problem is not to rely on a dictionary alone but to adopt automatic translation according to pronunciation similarities, i.e. to map phonemes comprising an English name to sound units (e.g. pinyin) of the corresponding Chinese name. This process is called transliteration. We present a statistical transliteration method for CLIR applications. An efficient algorithm for phoneme alignment is described. Unlike traditional rule-based approaches, our method is data-driven. So it is independent of dialect features in Chinese. In addition, it is different from other statistical approaches based on source-channel framework in that we adopt a direct transliteration model, i.e. the direction of probabilistic estimation is consistent with transliteration direction. We demonstrate comparable performance on accuracy to other systems. 1
Financial Activity Mining from Online Multilingual News.

Mining events and new name translations from online daily news.

Exploiting Hierarchical Domain Values in Classification Learning.

Lazy Learning by Scanning Memory Image Lattice.
instance-based learning SMILE (Scanning Memory Image LatticE) is a lazy learning framework based on a memory image lattice scanning technique. To classify an unseen instance, the instances in the training set will generate a memory image lattice in terms of the similarities between the training instances and the unseen instance. An exploration algorithm of memory image lattice is designed to search an appropriate set of images of training instances to produce the final prediction. SMILE differs from other lazy learning algorithms in that it utilizes subsets of attribute values as much as possible. This design leads to a more flexible model which is less sensitive to data sparseness. 1
Text Mining from Site Invariant and Dependent Features for Information Extraction Knowledge Adaptation.

Learning phonetic similarity for matching named entity translations and mining new translations.

Evaluation Challenges in Large%2DScale Document Summarization.
We present a large-scale meta evaluation  of eight evaluation measures for both  single-document and multi-document  summarizers. To this end we built a  corpus consisting of (a) 100 Million automatic  summaries using six summarizers  and baselines at ten summary lengths in  both English and Chinese, (b) more than  10,000 manual abstracts and extracts, and  (c) 200 Million automatic document and  summary retrievals using 20 queries. We  present both qualitative and quantitative  results showing the strengths and drawbacks  of all evaluation methods and how  they rank the different summarizers.
Digesting Bilingual Web News via Mining Financial Activities and Events.

Exploiting Heterogeneous Features for Classification Learning.

Beyond Supervised Learning of Wrappers for Extracting Information from Unseen Web Sites.

Discovering Bilingual Name Association and Translation From Online News of Different Sources.

Supporting Story Link Detection Using Automatic Topic Type Categorization.

Using Support Vector Machines for Terrorism Information Extraction.

Exploiting Hierarchical Domain Values for Bayesian Learning.

High%2DDimensional Learning Framework for Adaptive Document Filtering.

Web Discovery and Filtering Based on Textual Relevance Feedback Learning.

Automatic Textual Document Categorization Based on Generalized Instance Sets and a Metamodel.

Direct gold and copper wires bonding on copper.

Meta%2Devaluation of Summaries in a Cross%2Dlingual Environment using Content%2Dbased Metrics.
We describe a framework for the evaluation of summaries in English and Chinese using similarity measures. The framework can be used to evaluate extractive, non-extractive, single and multi-document summarization. We focus on the resources developed that are made available for the research community. 1 
Adapting Information Extraction Knowledge For Unseen Web Sites.

News Sensitive Stock Trend Prediction.

Extracting Causation Knowledge from Natural Language Texts.


A Distributed Learning Algorithm for Bayesian Inference Networks.

Discovering Useful Concept Prototypes for Classification Based on Filtering and Abstraction.
AbstractÐThe nearest-neighbor algorithm and its derivatives have been shown to perform well for pattern classification. Despite their high classification accuracy, they suffer from high storage requirement, computational cost, and sensitivity to noise. We develop a new framework, called ICPL (Integrated Concept Prototype Learner), which integrates instance-filtering and instance-abstraction techniques by maintaining a balance of different kinds of concept prototypes according to instance locality. The abstraction component, based on typicality, employed in our ICPL framework is specially designed for concept integration. We have conducted experiments on a total of 50 real-world benchmark data sets. We find that our ICPL framework maintains or achieves better classification accuracy and gains a significant improvement in data reduction compared with existing filtering and abstraction techniques as well as some existing techniques. Index TermsÐPrototype learning, classification, instance abstraction, machine learning, data mining. 1

Learning good prototypes for classification using filtering and abstraction of instances.

A Collaborative Word Processing Systems using a CORBA%2DBased Workflow Framework.

Automatic Story Segmentation for Spoken Document Retrieval.

Automatic event generation from multi%2Dlingual news stories.
We propose a novel approach for automatic generation of topically-related events from multi-lingual news sources. Named entity terms are extracted automatically from the news content. Together with the content terms, they constitute the basis of representing the story. We employ transformation-based linguistic tagging approach for named entity extraction. Two methods of gross translation on Chinese story representation into English have been implemented. The first approach uses only a bilingual dictionary. The second method makes use of a parallel corpus as an additional resource. Unsupervised learning is employed to discover the events.  Keywords  Event Discovery, Event Detection, Multi-lingual Text Processing  1. 
Meta%2Dlearning Models for Automatic Textual Document Categorization.

A Meta%2DLearning Approach for Text Categorization.
Weinvestigate a meta-model approach, called Meta-learning Using DocumentFeature characteristics (MUDOF), for the task of automatic textual document categorization. It employs a meta-learning phase using document feature characteristics. Document feature characteristics, derived from the training document set, capture some inherent categoryspecific properties of a particular category. Differentfrom  existing categorization methods, MUDOF can automatically recommend a suitable algorithm for each category based on the category-specific statistical characteristics. Hence, different algorithms may be employed for different categories. Experiments have been conducted on a real-world document collection demonstrating the effectiveness of our approach. The results confirm that our meta-model approach can exploit the advantage of its component algorithms, and demonstrate a better performance than existing algorithms.
FIDS an intelligent financial Web news articles digest system.

Modeling user interest shift using a bayesian approach.
We investigate the modeling of changes in user interest in information filtering systems. A new technique for tracking user interest shifts based on a Bayesian approach is developed. The interest tracker is integrated into a profile learning module of a filtering system. We present an analytical study to establish the rate of convergence for the profile learning with and without the user interest tracking component. We examine the relationship among degree of shift, cost of detection error, and time needed for detection. To study the effect of different patterns of interest shift on system performance we also conducted several filtering experiments. Generally, the findings show that the Bayesian approach is a feasible and effective technique for modeling user interest shift.
Chinese document indexing based on a new partitioned signature file Model and evaluation.

Learning to Extract Hierarchical Information from Semi%2Dstructured Documents.

Prototype Generation Based on Instance Filtering and Averaging.

Using discretization and Bayesian inference network learning for automatic filtering profile generation.

Automatic classification using supervised learning in a medical document filtering application.

Updating of Association Rules Dynamically.

An Intelligent Adaptive Filtering Agent Based on an On%2DLine Learning Model %28poster abstract%29.

Medical data mining using evolutionary computation.

Automatic Text Categorization and Its Application to Text Retrieval.
We develop an automatic text categorization approach and investigate its application to text retrieval. The categorization approach is derived from a combination of a learning paradigm known as instancebased learning and an advanced document retrieval technique known as retrieval feedback. We demonstrate the effectiveness of our categorization approach using two real-world document collections from the MEDLINE database. Next we investigate the application of automatic categorization to text retrieval. Our experiments clearly indicate that automatic categorization improves the retrieval performance compared with no categorization. We also demonstrate that the retrieval performance using automatic categorization achieves the same retrieval quality as the performance using manual categorization. Furthermore, detailed analysis of the retrieval performance on each individual test query is provided. Index Terms: Text Categorization, Automatic Classification, Text Retrieval, Instance-Based Le...
Using Evolutionary Programming and Minimum Description Length Principle for Data Mining of Bayesian Networks.

A New On%2DLine Learning Algorithm for Adaptive Text Filtering.

Constructing Text Filters Based on Bayesian Network Learning.

Using a Generalized Instance Set for Automatic Text Categorization.

Bayesian Network Refinement Via Machine Learning Approach.

Distributed Data Mining of Probabilistic Knowledge.

Using a Bayesian Network Induction Approach for Text Categorization.

A Multilevel Approach to Intelligent Information Filtering Model
this article, a filtering model is proposed that decomposes the overall task into subsystem functionalities and highlights the need for multiple adaptation techniques to cope with uncertainties. A filtering system, SIFTER, has been implemented based on the model, using established techniques in information retrieval and artificial intelligence. These techniques include document representation by a vector-space model, document classification by unsupervised learning, and user modeling by reinforcement learning. The system can filter information based on content and a user&#039;s specific interests. The user&#039;s interests are automatically learned with only limited user intervention in the form of optional relevance feedback for documents. We also describe experimental studies conducted with SIFTER to filter computer and information science documents collected from the Internet and commercial database services. The experimental results demonstrate that the system performs very well in filtering documents in a realistic problem setting.
A Two%2DLevel Approach to Learning in Nonstationary Environments.

Detection of Shifts in User Interests for Personalized Information Filtering.

Abstraction in Bayesian Belief Networks and Automatic Discovery from Past Inference Sessions.

Using New Data to Refine a Bayesian Network.
We explore the issue of refining an existent Bayesian network structure using new data which might mention only a subset of the variables. Most previous works have only considered the refinement of the network &#039;s conditional probability parameters, and have not addressed the issue of refining the network&#039;s structure. We develop a new approach for refining the network&#039;s structure. Our approach is based on the Minimal Description Length (MDL) principle, and it employs an adapted version of a Bayesian network learning algorithm developed in our previous work. One of the adaptations required is to modify the previous algorithm to account for the structure of the existent network. The learning algorithm generates a partial network structure which can then be used to improve the existent network. We also present experimental evidence demonstrating the effectiveness of our approach. 1 Introduction  A number of errors and inaccuracies can occur during the construction of a Bayesian net. For ex...
Learning Bayesian Belief Networks An Approach Based on the MDL Principle.
A new approach for learning Bayesian belief networks from raw data is presented. The approach is based on Rissanen&#039;s Minimal Description Length (MDL) principle, which is particularly well suited for this task. Our approach does not require any prior assumptions about the distribution being learned. In particular, our method can learn unrestricted multiply-connected belief networks. Furthermore, unlike other approaches our method allows us to tradeo accuracy and complexity in the learned model. This is important since if the learned model is very complex (highly connected) it can be conceptually and computationally intractable. In such a case it would be preferable to use a simpler model even if it is less accurate. The MDL principle o ers a reasoned method for making this tradeo. We also show that our method generalizes previous approaches based on Kullback cross-entropy. Experiments have been conducted to demonstrate the feasibility of the approach. Keywords: Knowledge Acquisition � Bayes Nets � Uncertainty Reasoning. 1
Using Causal Information and Local Measures to Learn Bayesian Networks.
In previous work we developed a method of learning Bayesian Network models from raw data. This method relies on the well known minimal description length (MDL) principle. The MDL principle is particularly well suited to this task as it allows us to tradeoff, in a principled way, the accuracy of the learned network against its practical usefulness. In this paper we present some new results that have arisen from our work. In particular, we present a new local way of computing the description length. This allows us to make significant improvements in our search algorithm. In addition, we modify our algorithm so that it can take into account partial domain information that might be provided by a domain expert. The local computation of description length also opens the door for local refinement of an existent network. The feasibility of our approach is demonstrated by experiments involving networks of a practical size.
